Improving Simulation-Based Algorithms for Fitting ERGMs
نویسندگان
چکیده
منابع مشابه
Improving Simulation-Based Algorithms for Fitting ERGMs.
Markov chain Monte Carlo methods can be used to approximate the intractable normalizing constants that arise in likelihood calculations for many exponential family random graph models for networks. However, in practice, the resulting approximations degrade as parameter values move away from the value used to define the Markov chain, even in cases where the chain produces perfectly efficient sam...
متن کاملA Steplength Algorithm for Fitting ERGMs
Markov chain Monte Carlo methods can be used to approximate the intractable normalizing constants that arise in likelihood calculations for many exponential family random graph models for networks. However, in practice, the resulting approximations degrade as parameter values move away from the value used to define the Markov chain. Here, we introduce a method of moving toward a maximum likelih...
متن کاملSimulation-Based Optimization for Improving Hospital Performance
Background and Objectives: Nowadays health services affect a significant part of social, economic and political parts of each country. In this case, hospitals are considered as the important and final stage of health service supply chain. Consequently, quality of health services offered by hospitals has a straight impact on the safety of individuals. Methods: </st...
متن کاملErgonomics and simulation-based approach in improving facility layout
The use of the simulation-based technique in facility layout has been a choice in the industry due to its convenience and efficient generation of results. Nevertheless, the solutions generated are not capable of addressing delays due to worker’s health and safety which significantly impact overall operational efficiency. It is, therefore, critical to incorporate ergonomics in facility design. I...
متن کاملImproving Unsatisfiability-Based Algorithms for Boolean Optimization
Recently, several unsatisfiability-based algorithms have been proposed for Maximum Satisfiability (MaxSAT) and other Boolean Optimization problems. These algorithms are based on being able to iteratively identify and relax unsatisfiable sub-formulas with the use of fast Boolean satisfiability solvers. It has been shown that this approach is very effective for several classes of instances, but i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2012
ISSN: 1061-8600,1537-2715
DOI: 10.1080/10618600.2012.679224